SChord: Handling Churn in Chord by Exploiting Node Session Time

نویسندگان

  • Feng Hong
  • Minglu Li
  • Jiadi Yu
چکیده

Peer-to-peer systems are distinguished from traditional distributed systems in that nodes join and leave the p2p system at high rates, called churn problem. SChord, a p2p system, is illustrated in this paper, which is constructed on Chord system and aims to handle churn. We analyze the past experimental studies on churn of p2p systems and do some theoretical analysis on the probability distribution of node session time. SChord is based on such analysis which can distinguish nodes of long session time from other p2p nodes and exploit these long session nodes with its special routing algorithm. The simulation shows that SChord has achieved better performance of churn handling than Chord.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Splay Tree-Based Approach for Efficient Resource Location in P2P Networks

Resource location in structured P2P system has a critical influence on the system performance. Existing analytical studies of Chord protocol have shown some potential improvements in performance. In this paper a splay tree-based new Chord structure called SChord is proposed to improve the efficiency of locating resources. We consider a novel implementation of the Chord finger table (routing tab...

متن کامل

Exploiting the Overhead in a DHT to Improve Lookup Latency

Third generation Peer-to-Peer (P2P) networks are characterized by the fact, that they are based on Distributed Hash Tables (DHT). Thus, it is intended to reduce the high signaling overhead observed in unstructured P2P networks like in Gnutella. However especially if the churn rate in the considered approach is high, i.e. nodes leaving and joining the network frequently (small session duration) ...

متن کامل

Performance Comparison of Erasure Codes for Different Churn Models in P2P Storage Systems

We evaluate the performance of erasure codes for different models in P2P storage systems. The comparative analysis is based on that node session length follows exponential distribution (ED), Pareto distribution (PD), and Weibull distribution (WD). The reliability theory is utilized to evaluate the mean data availability. More, we evaluate the impact of both node-join churn and erasure coding pa...

متن کامل

TAC: A Topology-Aware Chord-based Peer-to-Peer Network

Among structured Peer-to-Peer systems, Chord has a general popularity due to its salient features like simplicity, high scalability, small path length with respect to network size, and flexibility on node join and departure. However, Chord doesn’t take into account the topology of underlying physical network when a new node is being added to the system, thus resulting in high routing late...

متن کامل

Handling Node Churn in Decentralized Network Coordinate System

Network coordinates (NC) system is an efficient mechanism to predict Internet distance with scalable measurements. In this paper, we focus on the node churn problem the continuous process of nodes arrival and departure in distributed applications. Studies on Vivaldi, a representative distributed NC system, shows that under node churn the prediction accuracy of the NC system will be seriously im...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005